A Refined Unsymmetric Lanczos Eigensolver for Computing Accurate Eigentriplets of a Real Unsymmetric Matrix

نویسنده

  • JEAN CHRISTOPHE TREMBLAY
چکیده

For most unsymmetric matrices it is difficult to compute many accurate eigenvalues using the primitive form of the unsymmetric Lanczos algorithm (ULA). In this paper we propose a modification of the ULA. It is related to ideas used in [J. Chem. Phys. 122 (2005), 244107 (11 pages)] to compute resonance lifetimes. Using the refined ULA we suggest, the calculation of accurate extremal and interior eigenvalues is feasible. The refinement is simple: approximate right and left eigenvectors computed using the ULA are used to form a small projected matrix whose eigenvalues and eigenvectors are easily computed. There is no re-biorthogonalization of the Lanczos vectors and no need to store large numbers of vectors in memory. The method can therefore be used to compute eigenvalues of very large matrices. The idea is tested on several matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An effective method for eigen-problem solution of fluid-structure systems

Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...

متن کامل

On the squared unsymmetric Lanczos method

The biorthogonal Lanczos and the biconjugate gradient methods have been proposed as iterative methods to approximate the solution of nonsymmetric and indefinite linear systems. Sonneveld (1989) obtained the conjugate gradient squared by squaring the matrix polynomials of the biconjugate gradient method. Here we square the unsymmetric (or biorthogonal) Lanczos method for computing the eigenvalue...

متن کامل

Generalized block Lanczos methods for large unsymmetric eigenproblems

Generalized block Lanczos methods for large unsymmetric eigenproblems are presented, which contain the block Arnoldi method, and the block Arnoldi algorithms are developed. The convergence of this class of methods is analyzed when the matrix A is diagonalizable. Upper bounds for the distances between normalized eigenvectors and a block Krylov subspace are derived, and a priori theoretical error...

متن کامل

Efficient Implementation of the Improved Unsymmetric Lanczos Process on Massively Distributed Memory Computers

For the eigenvalues of a large and sparse unsymmetric co-eecient matrix, we have proposed an improved version of the unsymmetric Lanczos process combining elements of numerical stability and parallel algorithm design. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner produc...

متن کامل

Estimation of uTf(A)v for large-scale unsymmetric matrices

Fast algorithms, based on the unsymmetric look-ahead Lanczos and the Arnoldi process, are developed for the estimation of the functional (f)= uf(A)v for xed u; v and A, where A∈Rn×n is a largescale unsymmetric matrix. Numerical results are presented which validate the comparable accuracy of both approaches. Although the Arnoldi process reaches convergence more quickly in some cases, it has grea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007